Methods and apparatus for determining transport block size in wireless communication

ABSTRACT

Apparatuses and methods are disclosed for determining a transport block size (TBS) as a function of various parameters without cyclic dependencies between the parameters and TBS. The disclosed function can determine a TBS in a single pass, and the determined TBS allows the use of code blocks with equal code block size (CBS) in a transport block segmentation process. The determined TBS can provide byte-aligned code block lengths and require no padding bits in a transport block.

PRIORITY CLAIM

This application is a continuation of U.S. patent application Ser. No.16/192,697, filed Nov. 15, 2018, which claims priority to and thebenefit of provisional patent application No. 62/588,137 filed in theUnited States Patent Office on Nov. 17, 2017, each of which isincorporated herein by reference as if fully set forth below in itsentirety and for all applicable purposes.

TECHNICAL FIELD

The technology discussed below relates generally to wirelesscommunication systems, and more particularly, a procedure fordetermining a transport block size of data in wireless communication.

INTRODUCTION

In wireless communication, a device may process data for transmissionthrough a network or protocol stack including a packet data compressionprotocol (PDCP) layer, a radio link control (RLC) layer, a media accesscontrol (MAC) layer, and a physical (PHY) layer. The MAC layer selectsthe modulation and coding scheme (MCS) that configures the PHY layer.The MAC layer data provided to the PHY layer may be called a transportblock (TB). In some networks, the size of a TB is not fixed and maydepend on various factors such as the configured MCS and availabletime-frequency resources of the network. A transport block size (TBS)refers to the number of bits that can be carried in a TB. A TB may besegmented into multiple code blocks for encoding. A code block size(CBS) refers to the number of bits carried in a code block (CB).

BRIEF SUMMARY OF SOME EXAMPLES

The following presents a simplified summary of one or more aspects ofthe present disclosure, in order to provide a basic understanding ofsuch aspects. This summary is not an extensive overview of allcontemplated features of the disclosure, and is intended neither toidentify key or critical elements of all aspects of the disclosure norto delineate the scope of any or all aspects of the disclosure. Its solepurpose is to present some concepts of one or more aspects of thedisclosure in a simplified form as a prelude to the more detaileddescription that is presented later.

One aspect of the disclosure provides a method of transmitting data in atransport block (TB) in wireless communication. A wireless devicedetermines a maximum code block size Kb), a transport block level cyclicredundancy check size (L_(TB,CRC)), a code block level cyclic redundancycheck size (L_(CB,CRC)). The wireless device further determines a numberof code blocks associated with the TB based on the K_(cb), L_(TB,CRC),and L_(CB,CRC). The wireless device further determines a code block sizebased on the number of code blocks. Then the wireless device determinesa transport block size (TBS) of the TB in a single pass as a function ofthe determined K_(cb), L_(TB,CRC), L_(CB,CRC), number of code blocks,and code block size. The wireless device transmits the TB with the databased on the determined TBS.

Another aspect of the disclosure provides a method of transmitting datain a transport block (TB) in wireless communication. A wireless devicedetermines a transport block size (TBS) of the TB in a non-recursiveprocedure based on a plurality of parameters. The plurality ofparameters include a maximum code block size (K_(cb)), a transport blocklevel cyclic redundancy check size (L_(TB,CRC)), a code block levelcyclic redundancy check size (L_(CB,CRC)), a number of code blocksassociated with the TB, and a code block size K. The wireless devicetransmits the TB with the data based on the determined TBS.

Another aspect of the disclosure provides an apparatus of wirelesscommunication. The apparatus includes a communication interfaceconfigured to transmit data in a transport block (TB), a memory storedwith executable code, and a processor operatively coupled with thecommunication interface and the memory. The processor is configured bythe executable code to determine a maximum code block size (K_(cb)), atransport block level cyclic redundancy check size (L_(TB,CRC)), a codeblock level cyclic redundancy check size (L_(CB,CRC)). The processor isfurther configured to determine a number of code blocks associated withthe TB based on the K_(cb), L_(TB,CRC), and L_(CB,CRC). The processor isfurther configured to determine a code block size based on the number ofcode blocks. Then the processor is configured to determine a transportblock size (TBS) of the TB in a single pass as a function of thedetermined K_(cb), L_(TB,CRC), L_(CB,CRC), number of code blocks, andcode block size. The processor is further configured to transmit the TBwith the data based on the determined TBS.

Another aspect of the disclosure provides an apparatus of wirelesscommunication. The apparatus includes a communication interfaceconfigured to transmit data in a transport block (TB), a memory storedwith executable code, and a processor operatively coupled with thecommunication interface and the memory. The processor is configured bythe executable code to determine a transport block size (TBS) for the TBin a non-recursive procedure based on a plurality of parameters. Theplurality of parameters include a maximum code block size, a transportblock level cyclic redundancy check size, a code block level cyclicredundancy check size, a number of code blocks associated with the TB,and a code block size. The processor is further configured to transmitthe TB with the data based on the determined TBS.

Another aspect of the disclosure provides an apparatus of wirelesscommunication. The apparatus includes means for determining a maximumcode block size of a transport block (TB), a transport block levelcyclic redundancy check size, and a code block level cyclic redundancycheck size. The apparatus further includes means for determining anumber of code blocks associated with the TB based on the maximum codeblock size, transport block level cyclic redundancy check size, and codeblock level cyclic redundancy check size. The apparatus further includesmeans for determining a code block size based on the number of codeblocks. The apparatus further includes means for determining a transportblock size (TBS) for the TB in a single pass as a function of thedetermined maximum code block size, transport block level cyclicredundancy check size, code block level cyclic redundancy check size,number of code blocks, and code block size. The apparatus furtherincludes means for transmitting the TB with the data based on thedetermined TBS.

These and other aspects of the invention will become more fullyunderstood upon a review of the detailed description, which follows.Other aspects, features, and embodiments will become apparent to thoseof ordinary skill in the art, upon reviewing the following descriptionof specific, exemplary embodiments in conjunction with the accompanyingfigures. While features may be discussed relative to certain embodimentsand figures below, all embodiments can include one or more of theadvantageous features discussed herein. In other words, while one ormore embodiments may be discussed as having certain advantageousfeatures, one or more of such features may also be used in accordancewith the various embodiments discussed herein. In a similar fashion,while exemplary embodiments may be discussed below as device, system, ormethod embodiments it should be understood that such exemplaryembodiments can be implemented in various devices, systems, and methods.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a conceptual diagram illustrating an example of a radio accessnetwork.

FIG. 2 is a block diagram conceptually illustrating an example of ascheduling entity communicating with one or more scheduled entitiesaccording to some aspects of the present disclosure.

FIG. 3 illustrates an example of a wireless communication systemsupporting multiple-input multiple-output (MIMO).

FIG. 4 is a schematic diagram illustrating an organization of wirelessresources in an air interface utilizing orthogonal frequency divisionalmultiplexing (OFDM).

FIG. 5 is a block diagram conceptually illustrating an example of ahardware implementation for a scheduling entity according to someaspects of the disclosure.

FIG. 6 is a block diagram conceptually illustrating an example of ahardware implementation for a scheduled entity according to some aspectsof the disclosure.

FIG. 7 is a flow chart illustrating an exemplary process for determininga transport block size (TBS) using an equation in a single passaccording to some aspects of the present disclosure.

FIG. 8 is a flow chart illustrating an exemplary process for determininga maximum code block size according to some aspects of the presentdisclosure.

FIG. 9 is a flow chart illustrating an exemplary process for determininga cyclic redundancy check size for a transport block according to someaspects of the present disclosure.

FIG. 10 is a flow chart illustrating an exemplary process fordetermining a cyclic redundancy check size for a code block according tosome aspects of the present disclosure.

DETAILED DESCRIPTION

The detailed description set forth below in connection with the appendeddrawings is intended as a description of various configurations and isnot intended to represent the only configurations in which the conceptsdescribed herein may be practiced. The detailed description includesspecific details for the purpose of providing a thorough understandingof various concepts. However, it will be apparent to those skilled inthe art that these concepts may be practiced without these specificdetails. In some instances, well-known structures and components areshown in block diagram form in order to avoid obscuring such concepts.

While aspects and embodiments are described in this application byillustration to some examples, those skilled in the art will understandthat additional implementations and use cases may come about in manydifferent arrangements and scenarios. Innovations described herein maybe implemented across many differing platform types, devices, systems,shapes, sizes, packaging arrangements. For example, embodiments and/oruses may come about via integrated chip embodiments and othernon-module-component based devices (e.g., end-user devices, vehicles,communication devices, computing devices, industrial equipment,retail/purchasing devices, medical devices, AI-enabled devices, etc.).While some examples may or may not be specifically directed to use casesor applications, a wide assortment of applicability of describedinnovations may occur. Implementations may range a spectrum fromchip-level or modular components to non-modular, non-chip-levelimplementations and further to aggregate, distributed, or OEM devices orsystems incorporating one or more aspects of the described innovations.In some practical settings, devices incorporating described aspects andfeatures may also necessarily include additional components and featuresfor implementation and practice of claimed and described embodiments.For example, transmission and reception of wireless signals necessarilyincludes a number of components for analog and digital purposes (e.g.,hardware components including antenna, RF-chains, power amplifiers,modulators, buffer, processor(s), interleaver, adders/summers, etc.). Itis intended that innovations described herein may be practiced in a widevariety of devices, chip-level components, systems, distributedarrangements, end-user devices, etc. of varying sizes, shapes andconstitution.

In next-generation networks like 5G New Radio (NR), communicationresource allocation is more flexible to handle diverse types of wirelesscommunication devices and services. In current communication networkslike Long-term Evolution (LTE), a wireless communication device may usea transport block size (TBS) table to determine the TBS. However, suchapproach may result in an undesirably large TBS table due to variousslot configurations, demodulation reference signal (DMRS) assumptions,use of control resources, and many other flexibilities provided innext-generation networks.

Some aspects of the present disclosure provide apparatuses and methodsfor determining a transport block size (TB S) as a function of variousparameters without cyclic dependencies between the parameters and TBS.The disclosed function can determine a TBS in a single pass, and thedetermined TBS allows the use of code blocks with equal code block size(CBS) in a transport block segmentation process. In addition, thedetermined TBS provides byte-aligned code block lengths and requires nopadding bits in a transport block.

The various concepts presented throughout this disclosure may beimplemented across a broad variety of telecommunication systems, networkarchitectures, and communication standards. Referring now to FIG. 1, asan illustrative example without limitation, various aspects of thepresent disclosure are illustrated with reference to a wirelesscommunication system 100. The wireless communication system 100 includesthree interacting domains: a core network 102, a radio access network(RAN) 104, and a user equipment (UE) 106. By virtue of the wirelesscommunication system 100, the UE 106 may be enabled to carry out datacommunication with an external data network 110, such as (but notlimited to) the Internet.

The RAN 104 may implement any suitable wireless communication technologyor technologies to provide radio access to the UE 106. As one example,the RAN 104 may operate according to 3^(rd) Generation PartnershipProject (3GPP) New Radio (NR) specifications, often referred to as 5G.As another example, the RAN 104 may operate under a hybrid of 5G NR andEvolved Universal Terrestrial Radio Access Network (eUTRAN) standards,often referred to as LTE. The 3GPP refers to this hybrid RAN as anext-generation RAN, or NG-RAN. Of course, many other examples may beutilized within the scope of the present disclosure.

As illustrated, the RAN 104 includes a plurality of base stations 108.Broadly, a base station is a network element in a radio access networkresponsible for radio transmission and reception in one or more cells toor from a UE. In different technologies, standards, or contexts, a basestation may variously be referred to by those skilled in the art as abase transceiver station (BTS), a radio base station, a radiotransceiver, a transceiver function, a basic service set (BSS), anextended service set (ESS), an access point (AP), a Node B (NB), aneNode B (eNB), a gNode B (gNB), or some other suitable terminology.

The radio access network 104 is further illustrated supporting wirelesscommunication for multiple mobile apparatuses. A mobile apparatus may bereferred to as user equipment (UE) in 3GPP standards, but may also bereferred to by those skilled in the art as a mobile station (MS), asubscriber station, a mobile unit, a subscriber unit, a wireless unit, aremote unit, a mobile device, a wireless device, a wirelesscommunications device, a remote device, a mobile subscriber station, anaccess terminal (AT), a mobile terminal, a wireless terminal, a remoteterminal, a handset, a terminal, a user agent, a mobile client, aclient, or some other suitable terminology. A UE may be an apparatus(e.g., a mobile apparatus) that provides a user with access to networkservices.

Within the present document, a “mobile” apparatus need not necessarilyhave a capability to move, and may be stationary. The term mobileapparatus or mobile device broadly refers to a diverse array of devicesand technologies. UEs may include a number of hardware structuralcomponents sized, shaped, and arranged to help in communication; suchcomponents can include antennas, antenna arrays, RF chains, amplifiers,one or more processors, etc. electrically coupled to each other. Forexample, some non-limiting examples of a mobile apparatus include amobile, a cellular (cell) phone, a smart phone, a session initiationprotocol (SIP) phone, a laptop, a personal computer (PC), a notebook, anetbook, a smartbook, a tablet, a personal digital assistant (PDA), anda broad array of embedded systems, e.g., corresponding to an “Internetof things” (IoT). A mobile apparatus may additionally be an automotiveor other transportation vehicle, a remote sensor or actuator, a robot orrobotics device, a satellite radio, a global positioning system (GPS)device, an object tracking device, a drone, a multi-copter, aquad-copter, a remote control device, a consumer and/or wearable device,such as eyewear, a wearable camera, a virtual reality device, a smartwatch, a health or fitness tracker, a digital audio player (e.g., MP3player), a camera, a game console, etc. A mobile apparatus mayadditionally be a digital home or smart home device such as a homeaudio, video, and/or multimedia device, an appliance, a vending machine,intelligent lighting, a home security system, a smart meter, etc. Amobile apparatus may additionally be a smart energy device, a securitydevice, a solar panel or solar array, a municipal infrastructure devicecontrolling electric power (e.g., a smart grid), lighting, water, etc.;an industrial automation and enterprise device; a logistics controller;agricultural equipment; military defense equipment, vehicles, aircraft,ships, and weaponry, etc. Still further, a mobile apparatus may providefor connected medicine or telemedicine support, e.g., health care at adistance. Telehealth devices may include telehealth monitoring devicesand telehealth administration devices, whose communication may be givenpreferential treatment or prioritized access over other types ofinformation, e.g., in terms of prioritized access for transport ofcritical service data, and/or relevant QoS for transport of criticalservice data.

Wireless communication between a RAN 104 and a UE 106 may be describedas utilizing an air interface. Transmissions over the air interface froma base station (e.g., base station 108) to one or more UEs (e.g., UE106) may be referred to as downlink (DL) transmission. In accordancewith certain aspects of the present disclosure, the term downlink mayrefer to a point-to-multipoint transmission originating at a schedulingentity (described further below; e.g., base station 108). Another way todescribe this scheme may be to use the term broadcast channelmultiplexing. Transmissions from a UE (e.g., UE 106) to a base station(e.g., base station 108) may be referred to as uplink (UL)transmissions. In accordance with further aspects of the presentdisclosure, the term uplink may refer to a point-to-point transmissionoriginating at a scheduled entity (described further below; e.g., UE106).

In some examples, access to the air interface may be scheduled, whereina scheduling entity (e.g., a base station 108) allocates resources forcommunication among some or all devices and equipment within its servicearea or cell. Within the present disclosure, as discussed further below,the scheduling entity may be responsible for scheduling, assigning,reconfiguring, and releasing resources for one or more scheduledentities. That is, for scheduled communication, UEs 106, which may bescheduled entities, may utilize resources allocated by the schedulingentity 108.

Base stations 108 are not the only entities that may function asscheduling entities. That is, in some examples, a UE may function as ascheduling entity, scheduling resources for one or more scheduledentities (e.g., one or more other UEs).

As illustrated in FIG. 1, a scheduling entity 108 may broadcast downlinktraffic 112 to one or more scheduled entities 106. Broadly, thescheduling entity 108 is a node or device responsible for schedulingtraffic in a wireless communication network, including the downlinktraffic 112 and, in some examples, uplink traffic 116 from one or morescheduled entities 106 to the scheduling entity 108. On the other hand,the scheduled entity 106 is a node or device that receives downlinkcontrol information 114, including but not limited to schedulinginformation (e.g., a grant), synchronization or timing information, orother control information from another entity in the wirelesscommunication network such as the scheduling entity 108.

In general, base stations 108 may include a backhaul interface forcommunication with a backhaul portion 120 of the wireless communicationsystem. The backhaul 120 may provide a link between a base station 108and the core network 102. Further, in some examples, a backhaul networkmay provide interconnection between the respective base stations 108.Various types of backhaul interfaces may be employed, such as a directphysical connection, a virtual network, or the like using any suitabletransport network.

The core network 102 may be a part of the wireless communication system100, and may be independent of the radio access technology used in theRAN 104. In some examples, the core network 102 may be configuredaccording to 5G standards (e.g., 5GC). In other examples, the corenetwork 102 may be configured according to a 4G evolved packet core(EPC), or any other suitable standard or configuration.

Referring now to FIG. 2, by way of example and without limitation, aschematic illustration of a RAN 200 is provided. In some examples, theRAN 200 may be the same as the RAN 104 described above and illustratedin FIG. 1. The geographic area covered by the RAN 200 may be dividedinto cellular regions (cells) that can be uniquely identified by a userequipment (UE) based on an identification broadcasted from one accesspoint or base station. FIG. 2 illustrates macrocells 202, 204, and 206,and a small cell 208, each of which may include one or more sectors (notshown). A sector is a sub-area of a cell. All sectors within one cellare served by the same base station. A radio link within a sector can beidentified by a single logical identification belonging to that sector.In a cell that is divided into sectors, the multiple sectors within acell can be formed by groups of antennas with each antenna responsiblefor communication with UEs in a portion of the cell.

In FIG. 2, two base stations 210 and 212 are shown in cells 202 and 204;and a third base station 214 is shown controlling a remote radio head(RRH) 216 in cell 206. That is, a base station can have an integratedantenna or can be connected to an antenna or RRH by feeder cables. Inthe illustrated example, the cells 202, 204, and 126 may be referred toas macrocells, as the base stations 210, 212, and 214 support cellshaving a large size. Further, a base station 218 is shown in the smallcell 208 (e.g., a microcell, picocell, femtocell, home base station,home Node B, home eNode B, etc.) which may overlap with one or moremacrocells. In this example, the cell 208 may be referred to as a smallcell, as the base station 218 supports a cell having a relatively smallsize. Cell sizing can be done according to system design as well ascomponent constraints.

It is to be understood that the radio access network 200 may include anynumber of wireless base stations and cells. Further, a relay node may bedeployed to extend the size or coverage area of a given cell. The basestations 210, 212, 214, 218 provide wireless access points to a corenetwork for any number of mobile apparatuses. In some examples, the basestations 210, 212, 214, and/or 218 may be the same as the basestation/scheduling entity 108 described above and illustrated in FIG. 1.

FIG. 2 further includes a quadcopter or drone 220, which may beconfigured to function as a base station. That is, in some examples, acell may not necessarily be stationary, and the geographic area of thecell may move according to the location of a mobile base station such asthe quadcopter 220.

Within the RAN 200, the cells may include UEs that may be incommunication with one or more sectors of each cell. Further, each basestation 210, 212, 214, 218, and 220 may be configured to provide anaccess point to a core network 102 (see FIG. 1) for all the UEs in therespective cells. For example, UEs 222 and 224 may be in communicationwith base station 210; UEs 226 and 228 may be in communication with basestation 212; UEs 230 and 232 may be in communication with base station214 by way of RRH 216; UE 234 may be in communication with base station218; and UE 236 may be in communication with mobile base station 220. Insome examples, the UEs 222, 224, 226, 228, 230, 232, 234, 236, 238, 240,and/or 242 may be the same as the UE/scheduled entity 106 describedabove and illustrated in FIG. 1.

In some examples, a mobile network node (e.g., quadcopter 220) may beconfigured to function as a UE. For example, the quadcopter 220 mayoperate within cell 202 by communicating with base station 210.

In a further aspect of the RAN 200, sidelink signals may be used betweenUEs without necessarily relying on scheduling or control informationfrom a base station. For example, two or more UEs (e.g., UEs 226 and228) may communicate with each other using peer to peer (P2P) orsidelink signals 227 without relaying that communication through a basestation (e.g., base station 212). In a further example, UE 238 isillustrated communicating with UEs 240 and 242. Here, the UE 238 mayfunction as a scheduling entity or a primary sidelink device, and UEs240 and 242 may function as a scheduled entity or a non-primary (e.g.,secondary) sidelink device. In still another example, a UE may functionas a scheduling entity in a device-to-device (D2D), peer-to-peer (P2P),or vehicle-to-vehicle (V2V) network, and/or in a mesh network. In a meshnetwork example, UEs 240 and 242 may optionally communicate directlywith one another in addition to communicating with the scheduling entity238. Thus, in a wireless communication system with scheduled access totime-frequency resources and having a cellular configuration, a P2Pconfiguration, or a mesh configuration, a scheduling entity and one ormore scheduled entities may communicate utilizing the scheduledresources.

In the radio access network 200, the ability for a UE to communicatewhile moving, independent of its location, is referred to as mobility.The various physical channels between the UE and the radio accessnetwork are generally set up, maintained, and released under the controlof an access and mobility management function (AMF, not illustrated,part of the core network 102 in FIG. 1), which may include a securitycontext management function (SCMF) that manages the security context forboth the control plane and the user plane functionality, and a securityanchor function (SEAF) that performs authentication.

In various aspects of the disclosure, a radio access network 200 mayutilize DL-based mobility or UL-based mobility to enable mobility andhandovers (i.e., the transfer of a UE's connection from one radiochannel to another). In a network configured for DL-based mobility,during a call with a scheduling entity, or at any other time, a UE maymonitor various parameters of the signal from its serving cell as wellas various parameters of neighboring cells. Depending on the quality ofthese parameters, the UE may maintain communication with one or more ofthe neighboring cells. During this time, if the UE moves from one cellto another, or if signal quality from a neighboring cell exceeds thatfrom the serving cell for a given amount of time, the UE may undertake ahandoff or handover from the serving cell to the neighboring (target)cell. For example, UE 224 (illustrated as a vehicle, although anysuitable form of UE may be used) may move from the geographic areacorresponding to its serving cell 202 to the geographic areacorresponding to a neighbor cell 206. When the signal strength orquality from the neighbor cell 206 exceeds that of its serving cell 202for a given amount of time, the UE 224 may transmit a reporting messageto its serving base station 210 indicating this condition. In response,the UE 224 may receive a handover command, and the UE may undergo ahandover to the cell 206.

In a network configured for UL-based mobility, UL reference signals fromeach UE may be utilized by the network to select a serving cell for eachUE. In some examples, the base stations 210, 212, and 214/216 maybroadcast unified synchronization signals (e.g., unified PrimarySynchronization Signals (PSSs), unified Secondary SynchronizationSignals (SSSs) and unified Physical Broadcast Channels (PBCH)). The UEs222, 224, 226, 228, 230, and 232 may receive the unified synchronizationsignals, derive the carrier frequency and slot timing from thesynchronization signals, and in response to deriving timing, transmit anuplink pilot or reference signal. The uplink pilot signal transmitted bya UE (e.g., UE 224) may be concurrently received by two or more cells(e.g., base stations 210 and 214/216) within the radio access network200. Each of the cells may measure a strength of the pilot signal, andthe radio access network (e.g., one or more of the base stations 210 and214/216 and/or a central node within the core network) may determine aserving cell for the UE 224. As the UE 224 moves through the radioaccess network 200, the network may continue to monitor the uplink pilotsignal transmitted by the UE 224. When the signal strength or quality ofthe pilot signal measured by a neighboring cell exceeds that of thesignal strength or quality measured by the serving cell, the network 200may handover the UE 224 from the serving cell to the neighboring cell,with or without informing the UE 224.

Although the synchronization signal transmitted by the base stations210, 212, and 214/216 may be unified, the synchronization signal may notidentify a particular cell, but rather may identify a zone of multiplecells operating on the same frequency and/or with the same timing. Theuse of zones in 5G networks or other next-generation communicationnetworks enables the uplink-based mobility framework and improves theefficiency of both the UE and the network, since the number of mobilitymessages that need to be exchanged between the UE and the network may bereduced.

In various implementations, the air interface in the radio accessnetwork 200 may utilize licensed spectrum, unlicensed spectrum, orshared spectrum. Licensed spectrum provides for exclusive use of aportion of the spectrum, generally by virtue of a mobile networkoperator purchasing a license from a government regulatory body.Unlicensed spectrum provides for shared use of a portion of the spectrumwithout need for a government-granted license. While compliance withsome technical rules is generally still required to access unlicensedspectrum, generally, any operator or device may gain access. Sharedspectrum may fall between licensed and unlicensed spectrum, whereintechnical rules or limitations may be required to access the spectrum,but the spectrum may still be shared by multiple operators and/ormultiple RATs. For example, the holder of a license for a portion oflicensed spectrum may provide licensed shared access (LSA) to share thatspectrum with other parties, e.g., with suitable licensee-determinedconditions to gain access.

The air interface in the radio access network 200 may utilize one ormore duplexing algorithms. Duplex refers to a point-to-pointcommunication link where both endpoints can communicate with one anotherin both directions. Full duplex means both endpoints can simultaneouslycommunicate with one another. Half duplex means only one endpoint cansend information to the other at a time. In a wireless link, a fullduplex channel generally relies on physical isolation of a transmitterand receiver, and suitable interference cancellation technologies. Fullduplex emulation is frequently implemented for wireless links byutilizing frequency division duplex (FDD) or time division duplex (TDD).In FDD, transmissions in different directions operate at differentcarrier frequencies. In TDD, transmissions in different directions on agiven channel are separated from one another using time divisionmultiplexing. That is, at some times the channel is dedicated fortransmissions in one direction, while at other times the channel isdedicated for transmissions in the other direction, where the directionmay change very rapidly, e.g., several times per slot.

In some aspects of the disclosure, the scheduling entity and/orscheduled entity may be configured for beamforming and/or multiple-inputmultiple-output (MIMO) technology. FIG. 3 illustrates an example of awireless communication system 300 supporting MIMO. In a MIMO system, atransmitter 302 includes multiple transmit antennas 304 (e.g., Ntransmit antennas) and a receiver 306 includes multiple receive antennas308 (e.g., M receive antennas). Thus, there are N×M signal paths 310from the transmit antennas 304 to the receive antennas 308. Each of thetransmitter 302 and the receiver 306 may be implemented, for example,within a scheduling entity 108, a scheduled entity 106, or any othersuitable wireless communication device.

The use of such multiple antenna technology enables the wirelesscommunication system to exploit the spatial domain to support spatialmultiplexing, beamforming, and transmit diversity. Spatial multiplexingmay be used to transmit different streams of data, also referred to aslayers, simultaneously on the same time-frequency resource. The numberof data streams or layers corresponds to the rank of the transmission.In general, the rank of the MIMO system 300 is limited by the number oftransmit or receive antennas 304 or 308, whichever is lower. Inaddition, the channel conditions at the UE, as well as otherconsiderations, such as the available resources at the base station, mayalso affect the transmission rank. For example, the rank (and therefore,the number of data streams) assigned to a particular UE on the downlinkmay be determined based on the rank indicator (RI) transmitted from theUE to the base station. The RI may be determined based on the antennaconfiguration (e.g., the number of transmit and receive antennas) and ameasured signal-to-interference-and-noise ratio (SINR) on each of thereceive antennas. The RI may indicate, for example, the number of layersthat may be supported under the current channel conditions. The basestation may use the RI, along with resource information (e.g., theavailable resources and amount of data to be scheduled for the UE), toassign a transmission rank to the UE.

In the simplest case, as shown in FIG. 3, a rank-2 spatial multiplexingtransmission on a 2×2 MIMO antenna configuration will transmit one datastream from each transmit antenna 304. Each data stream reaches eachreceive antenna 308 along a different signal path 310. The receiver 306may then reconstruct the data streams using the received signals fromeach receive antenna 308.

In order for transmissions over the radio access network 200 to obtain alow block error rate (BLER) while still achieving very high data rates,channel coding may be used. That is, wireless communication maygenerally utilize a suitable error correcting block code. In a typicalblock code, an information message or sequence is split up into codeblocks (CBs), and an encoder (e.g., a CODEC) at the transmitting devicethen mathematically adds redundancy to the information message.Exploitation of this redundancy in the encoded information message canimprove the reliability of the message, enabling correction for any biterrors that may occur due to the noise.

In early 5G NR specifications, user data is coded using quasi-cycliclow-density parity check (LDPC) with two different base graphs: one basegraph is used for large code blocks and/or high code rates, while theother base graph is used otherwise. Control information and the physicalbroadcast channel (PBCH) are coded using Polar coding, based on nestedsequences. For these channels, puncturing, shortening, and repetitionare used for rate matching.

A base graph (BG) refers to LPDC codes that have certain performancecharacteristics such as a maximum code rate and a minimum code rate. Inone example, a first base graph (BG1) can support a minimum code rate of1/3, and a second base graph (BG2) can support a minimum code rate of1/5. The maximum size of a code block depends on the base graph. A basegraph (e.g., BG1 and BG2) is selected to provide better performancebased on code block sizes or lengths. For example, BG2 is generally usedfor lower code rates than those for BG1. Examples of base graphs may befound in the 3GPP standards such as Technical Specification 38.212 v1.1.2, Multiplexing and channel coding (Release 15).

In one example, for initial transmissions with code rate (R_(init))greater than 1/4, BG2 is not used when TBS is greater 3824 bits.However, BG2 is used for initial transmissions with code rate less thanor equal to 1/4 for all TBS supported at that code rate. When BG2 isused with TBS greater than 3824 bits, the TB is segmented into codeblocks no larger than 3840 bits.

In one aspect of the disclosure, for a code block size (K) less than orequal to 308 bit, BG2 may be used for all code rates. In the 5G NRstandards, the maximum code block size (K_(cb)) is 8448 bits for usewith BG1 and 3840 bits for use with BG2. In one example, BG1 is used forthe initial transmission and subsequent re-transmissions of the same TBwhen CBS is greater than X (e.g., X=3840) or code rate of the initialtransmission is greater than Y (e.g., Y=0.67). In one example, BG2 isused for the initial transmission and subsequent re-transmissions of thesame TB, when CBS is less or equal to X and code rate of the initialtransmission is less than or equal to Y.

However, those of ordinary skill in the art will understand that aspectsof the present disclosure may be implemented utilizing any suitablechannel code. Various implementations of scheduling entities 108 andscheduled entities 106 may include suitable hardware and capabilities(e.g., an encoder, a decoder, and/or a CODEC) to utilize one or more ofthese channel codes for wireless communication.

The air interface in the radio access network 200 may utilize one ormore multiplexing and multiple access algorithms to enable simultaneouscommunication of the various devices. For example, 5G NR specificationsprovide multiple access for UL transmissions from UEs 222 and 224 tobase station 210, and for multiplexing for DL transmissions from basestation 210 to one or more UEs 222 and 224, utilizing orthogonalfrequency division multiplexing (OFDM) with a cyclic prefix (CP). Inaddition, for UL transmissions, 5G NR specifications provide support fordiscrete Fourier transform-spread-OFDM (DFT-s-OFDM) with a CP (alsoreferred to as single-carrier I-DMA (SC-FDMA)). However, within thescope of the present disclosure, multiplexing and multiple access arenot limited to the above schemes, and may be provided utilizing timedivision multiple access (TDMA), code division multiple access (CDMA),frequency division multiple access (FDMA), sparse code multiple access(SCMA), resource spread multiple access (RSMA), or other suitablemultiple access schemes. Further, multiplexing DL transmissions from thebase station 210 to UEs 222 and 224 may be provided utilizing timedivision multiplexing (TDM), code division multiplexing (CDM), frequencydivision multiplexing (FDM), orthogonal frequency division multiplexing(OFDM), sparse code multiplexing (SCM), or other suitable multiplexingschemes.

Various aspects of the present disclosure will be described withreference to an OFDM waveform, schematically illustrated in FIG. 4. Itshould be understood by those of ordinary skill in the art that thevarious aspects of the present disclosure may be applied to aDFT-s-OFDMA waveform in substantially the same way as describedhereinbelow. That is, while some examples of the present disclosure mayfocus on an OFDM link for clarity, it should be understood that the sameprinciples may be applied as well to DFT-s-OFDMA waveforms.

Within the present disclosure, a frame refers to a predeterminedduration (e.g., 10 ms) for wireless transmissions, with each frameconsisting of a certain number of subframes (e.g., 10 subframes of 1 mseach). On a given carrier, there may be one set of frames in the UL, andanother set of frames in the DL. Referring now to FIG. 4, an expandedview of an exemplary DL subframe 402 is illustrated, showing an OFDMresource grid 404. However, as those skilled in the art will readilyappreciate, the PHY transmission structure for any particularapplication may vary from the example described here, depending on anynumber of factors. Here, time is in the horizontal direction with unitsof OFDM symbols; and frequency is in the vertical direction with unitsof subcarriers or tones.

The resource grid 404 may be used to schematically representtime-frequency resources for a given antenna port. The resource grid 404is divided into multiple resource elements (REs) 406. An RE, which is 1subcarrier×1 symbol, is the smallest discrete part of the time-frequencygrid, and contains a single complex value representing data from aphysical channel or signal. Depending on the modulation utilized in aparticular implementation, each RE may represent one or more bits ofinformation. In some examples, a block of REs may be referred to as aphysical resource block (PRB) or more simply a resource block (RB) 408,which contains any suitable number of consecutive subcarriers in thefrequency domain. In one example, an RB may include 12 subcarriers, anumber independent of the numerology used. In some examples, dependingon the numerology, an RB may include any suitable number of consecutiveOFDM symbols in the time domain. Within the present disclosure, it isassumed that a single RB such as the RB 408 entirely corresponds to asingle direction of communication (either transmission or reception fora given device).

A UE generally utilizes only a subset of the resource grid 404. An RBmay be the smallest unit of resources that can be allocated to a UE.Thus, the more RBs scheduled for a UE, and the higher the modulationscheme chosen for the air interface, the higher the data rate for theUE.

In this illustration, the RB 408 is shown as occupying less than theentire bandwidth of the subframe 402, with some subcarriers illustratedabove and below the RB 408. In a given implementation, the subframe 402may have a bandwidth corresponding to any number of one or more RBs 408.Further, in this illustration, the RB 408 is shown as occupying lessthan the entire duration of the subframe 402, although this is merelyone possible example.

Each subframe 402 (e.g., 1 ms subframe) may consist of one or multipleadjacent slots. In the example shown in FIG. 4, one subframe 402includes four slots 410, as an illustrative example. In some examples, aslot may be defined according to a specified number of OFDM symbols witha given cyclic prefix (CP) length. For example, a slot may include 7 or14 OFDM symbols with a nominal CP. Additional examples may includemini-slots having a shorter duration (e.g., 1, 2, 4, or 7 OFDM symbols).These mini-slots may in some cases be transmitted occupying resourcesscheduled for ongoing slot transmissions for the same or for differentUEs.

An expanded view of one of the slots 410 illustrates the slot 410including a control region 412 and a data region 414. In general, thecontrol region 412 may carry control channels (e.g., PDCCH), and thedata region 414 may carry data channels (e.g., PDSCH or PUSCH). Ofcourse, a slot may contain all DL, all UL, or at least one DL portionand at least one UL portion. The simple structure illustrated in FIG. 4is merely exemplary in nature, and different slot structures may beutilized, and may include one or more of each of the control region(s)and data region(s).

Although not illustrated in FIG. 4, the various REs 406 within a RB 408may be scheduled to carry one or more physical channels, includingcontrol channels, shared channels, data channels, etc. Other REs 406within the RB 408 may also carry pilots or reference signals, includingbut not limited to a demodulation reference signal (DMRS) a controlreference signal (CRS), or a sounding reference signal (SRS). Thesepilots or reference signals may provide for a receiving device toperform channel estimation of the corresponding channel, which mayenable coherent demodulation/detection of the control and/or datachannels within the RB 408.

In a DL transmission, the transmitting device (e.g., the schedulingentity 108) may allocate one or more REs 406 (e.g., within a controlregion 412) to carry DL control information 114 including one or more DLcontrol channels that generally carry information originating fromhigher layers, such as a physical broadcast channel (PBCH), a physicaldownlink control channel (PDCCH), etc., to one or more scheduledentities 106. In addition, DL REs may be allocated to carry DL physicalsignals that generally do not carry information originating from higherlayers. These DL physical signals may include a primary synchronizationsignal (PSS); a secondary synchronization signal (SSS); demodulationreference signals (DM-RS); phase-tracking reference signals (PT-RS);channel-state information reference signals (CSI-RS); etc. The PDCCH maycarry downlink control information (DCI) for one or more UEs in a cell.This can include, but is not limited to, power control commands,scheduling information, a grant, and/or an assignment of REs for DL andUL transmissions.

In an UL transmission, a transmitting device (e.g., a scheduled entity106) may utilize one or more REs 406 to carry UL control information 118(UCI). The UCI can originate from higher layers via one or more ULcontrol channels, such as a physical uplink control channel (PUCCH), aphysical random access channel (PRACH), etc., to the scheduling entity108. Further, UL REs may carry UL physical signals that generally do notcarry information originating from higher layers, such as demodulationreference signals (DM-RS), phase-tracking reference signals (PT-RS),sounding reference signals (SRS), etc. In some examples, the controlinformation 118 may include a scheduling request (SR), i.e., a requestfor the scheduling entity 108 to schedule uplink transmissions. Here, inresponse to the SR transmitted on the control channel 118, thescheduling entity 108 may transmit downlink control information 114 thatmay schedule resources for uplink packet transmissions.

UL control information may also include hybrid automatic repeat request(HARQ) feedback such as an acknowledgment (ACK) or negativeacknowledgment (NACK), channel state information (CSI), or any othersuitable UL control information. HARQ is a technique well-known to thoseof ordinary skill in the art, wherein the integrity of packettransmissions may be checked at the receiving side for accuracy, e.g.,utilizing any suitable integrity checking mechanism, such as a checksumor a cyclic redundancy check (CRC). If the integrity of the transmissionconfirmed, an ACK may be transmitted, whereas if not confirmed, a NACKmay be transmitted. In response to a NACK, the transmitting device maysend a HARQ retransmission, which may implement chase combining,incremental redundancy, etc.

In addition to control information, one or more REs 406 (e.g., withinthe data region 414) may be allocated for user data or traffic data.Such traffic may be carried on one or more traffic channels, such as,for a DL transmission, a physical downlink shared channel (PDSCH); orfor an UL transmission, a physical uplink shared channel (PUSCH).

The channels or carriers described above and illustrated in FIGS. 1, 2and 3 are not necessarily all the channels or carriers that may beutilized between a scheduling entity 108 and scheduled entities 106, andthose of ordinary skill in the art will recognize that other channels orcarriers may be utilized in addition to those illustrated, such as othertraffic, control, and feedback channels.

These physical channels described above are generally multiplexed andmapped to transport channels for handling at the medium access control(MAC) layer. Transport channels carry blocks of information calledtransport blocks (TB). The transport block size (TBS), which maycorrespond to a number of bits of information, may be a controlledparameter, based on the modulation and coding scheme (MCS) and thenumber of RBs in a given transmission.

FIG. 5 is a block diagram illustrating an example of a hardwareimplementation for a scheduling entity 500 employing a processing system514. For example, the scheduling entity 500 may be a user equipment (UE)as illustrated in any one or more of FIGS. 1, 2, and/or 3. In anotherexample, the scheduling entity 500 may be a base station as illustratedin any one or more of FIGS. 1, 2, and/or 3.

The scheduling entity 500 may be implemented with a processing system514 that includes one or more processors 504. Examples of processors 504include microprocessors, microcontrollers, digital signal processors(DSPs), field programmable gate arrays (FPGAs), programmable logicdevices (PLDs), state machines, gated logic, discrete hardware circuits,and other suitable hardware configured to perform the variousfunctionality described throughout this disclosure. In various examples,the scheduling entity 500 may be configured to perform any one or moreof the functions described herein. That is, the processor 504, asutilized in a scheduling entity 500, may be used to implement any one ormore of the processes and procedures described below and illustrated inFIGS. 7-10.

In this example, the processing system 514 may be implemented with a busarchitecture, represented generally by the bus 502. The bus 502 mayinclude any number of interconnecting buses and bridges depending on thespecific application of the processing system 514 and the overall designconstraints. The bus 502 communicatively couples together variouscircuits including one or more processors (represented generally by theprocessor 504), a memory 505, and computer-readable media (representedgenerally by the computer-readable medium 506). The bus 502 may alsolink various other circuits such as timing sources, peripherals, voltageregulators, and power management circuits, which are well known in theart, and therefore, will not be described any further. A bus interface508 provides an interface between the bus 502 and a transceiver 510. Thetransceiver 510 provides a communication interface or means forcommunicating with various other apparatus over a transmission medium.Depending upon the nature of the apparatus, a user interface 512 (e.g.,keypad, display, speaker, microphone, joystick) may also be provided. Ofcourse, such a user interface 512 is optional, and may be omitted insome examples, such as a base station.

In some aspects of the disclosure, the processor 504 may includecircuitry configured for various functions, including, for example, basegraph selection and transport block size determination used in wirelesscommunication. For example, the circuitry may be configured to implementone or more of the functions described below in relation to FIGS. 7-10.The processor 504 may include a processing circuit 540 that can beconfigured by processing instructions 522 to perform various dataprocessing functions used in wireless communication. The processor 504may include an uplink (UL) communication circuit 542 that can beconfigured by UL communication instructions 554 to perform variousfunctions used in UL communication. For example, the UL communicationcircuit 542 may schedule and allocate resources (e.g., MIMO layers,PRBs) for UL communication. The UL communication circuit 542 mayconfigure the target code rate, and modulation and coding scheme used inUL communication. The processor 504 may include a downlink (DL)communication circuit 544 that can be configured by DL communicationinstructions 556 to perform various functions used in DL communication.For example, the DL communication circuit 544 may schedule and allocateresources (e.g., MIMO layers, PRBs) for DL communication. The DLcommunication circuit 544 may configure the target code rate, andmodulation and coding scheme used in DL communication.

The processor 504 is responsible for managing the bus 502 and generalprocessing, including the execution of software stored on thecomputer-readable medium 506. The software, when executed by theprocessor 504, causes the processing system 514 to perform the variousfunctions described below for any particular apparatus. Thecomputer-readable medium 506 and the memory 505 may also be used forstoring data that is manipulated by the processor 504 when executingsoftware.

One or more processors 504 in the processing system may executesoftware. Software shall be construed broadly to mean instructions,instruction sets, code, code segments, program code, programs,subprograms, software modules, applications, software applications,software packages, routines, subroutines, objects, executables, threadsof execution, procedures, functions, etc., whether referred to assoftware, firmware, middleware, microcode, hardware descriptionlanguage, or otherwise. The software may reside on a computer-readablemedium 506. The computer-readable medium 506 may be a non-transitorycomputer-readable medium. A non-transitory computer-readable mediumincludes, by way of example, a magnetic storage device (e.g., hard disk,floppy disk, magnetic strip), an optical disk (e.g., a compact disc (CD)or a digital versatile disc (DVD)), a smart card, a flash memory device(e.g., a card, a stick, or a key drive), a random access memory (RAM), aread only memory (ROM), a programmable ROM (PROM), an erasable PROM(EPROM), an electrically erasable PROM (EEPROM), a register, a removabledisk, and any other suitable medium for storing software and/orinstructions that may be accessed and read by a computer. Thecomputer-readable medium 506 may reside in the processing system 514,external to the processing system 514, or distributed across multipleentities including the processing system 514. The computer-readablemedium 506 may be embodied in a computer program product. By way ofexample, a computer program product may include a computer-readablemedium in packaging materials. Those skilled in the art will recognizehow best to implement the described functionality presented throughoutthis disclosure depending on the particular application and the overalldesign constraints imposed on the overall system.

In one or more examples, the computer-readable storage medium 506 mayinclude software configured for various functions, including, forexample, base graph selection and transport block size determinationused in wireless communication. For example, the software may includethe processing instructions 552, UL communication instructions 554, andDL communication instructions 556 that may configure the processor 504to implement one or more of the functions described in relation to FIGS.7-10.

FIG. 6 is a conceptual diagram illustrating an example of a hardwareimplementation for an exemplary scheduled entity 600 employing aprocessing system 614. In accordance with various aspects of thedisclosure, an element, or any portion of an element, or any combinationof elements may be implemented with a processing system 614 thatincludes one or more processors 604. For example, the scheduled entity600 may be a user equipment (UE) as illustrated in any one or more ofFIGS. 1, 2, and/or 3.

The processing system 614 may be substantially the same as theprocessing system 614 illustrated in FIG. 4, including a bus interface608, a bus 602, memory 605, a processor 604, and a computer-readablemedium 606. Furthermore, the scheduled entity 600 may include a userinterface 612 and a transceiver 610 substantially similar to thosedescribed above in FIG. 4. That is, the processor 604, as utilized in ascheduled entity 600, may be used to implement any one or more of theprocesses and functions described below and illustrated in FIGS. 7-10.

In some aspects of the disclosure, the processor 604 may includecircuitry configured for various functions, including, for example, basegraph selection and transport block size determination used in wirelesscommunication. For example, the circuitry may be configured to implementone or more of the functions described in relation to FIGS. 7-10. Theprocessor 604 may include a processing circuit 640 that can beconfigured by processing instructions 622 to perform various dataprocessing functions used in wireless communication. The processor 604may include a communication circuit 642 that can be configured bycommunication instructions 654 to perform various functions used in ULand DL communication via the transceiver 610. The communication circuit642 may configure the target code rate, and modulation and coding schemeused in wireless communication. The processor 604 may include atransport block size (TBS) determination circuit 644 that can beconfigured by TBS determination instructions 656 to perform variousfunctions for selecting base graph and determining TBS used in wirelesscommunication.

In the 5G NR standards, a transport block size (TBS) may be determinedas a function of various parameters including N_(RE), V, Q_(m), and R.Here, N_(RE) is the number of resource elements (REs) assigned to atransport block (TB), v is the number of multiple-input andmultiple-output (MIMO) layers, Q_(m) is the modulation order, and R isthe code rate. However, some functions or procedures used fordetermining the TBS depend on cyclic dependencies between the TBS andthe parameters (e.g., N_(RE), v, Q_(m), and/or R) used to determine theTBS. Such cyclic dependencies may require use of recursive algorithmsand/or multiple passes of a certain formula or function in order todetermine the TBS. Therefore, the processing time and/or powerconsumption of the TBS determination may be undesirably increased orlengthened.

Aspects of the present disclosure provide a procedure and a method thatcan determine a TBS using a formula, function, equation, or algorithm ina single pass avoiding cyclic dependencies between the TB S and theparameters used in the formula or function. Moreover, the determined TBScan facilitate byte-aligned code block sizes and require no padding in atransport block.

In a 5G NR example, a TB-level CRC (L_(TB,CRC)) may be 24 bits for TBslarger than a predetermined threshold (e.g., 512 bits). If a TB issegmented into 2 or more CBs after CB segmentation, a CB-level CRC maybe applied to the CBs. K_(cb) is the maximum code block size. Forexample, CRC bits may be attached to each code block individually. Inthis case, L_(TB, CRC) may be 16 bits for TBs smaller than or equal to apredetermined threshold (e.g., 3824 bits), and CB-level CRC (L_(CB-CRC))may be 24 bits.

In one aspect of the present disclosure, TBS may be determined using asingle equation (1) below.

$\begin{matrix}{{TBS} = {{\left\lceil {\frac{1}{8}\frac{L_{{TB},{CRC}} + {N_{RE} \cdot Q_{m} \cdot R \cdot v} - X}{\left\lceil \frac{L_{{TB},{CRC}} + {N_{RE} \cdot Q_{m} \cdot R \cdot v} - X}{K_{cb} - L_{{CB},{CRC}}} \right\rceil}} \right\rceil 8\left\lceil \frac{L_{{TB},{CRC}} + {N_{RE} \cdot Q_{m} \cdot R \cdot v} - X}{K_{cb} - L_{{CB},{CRC}}} \right\rceil} - L_{{TB},{CRC}}}} & (1)\end{matrix}$

In equation (1), X is a rate back-off factor that has a value equal toor greater than zero. For example, X can be a predetermined constant(e.g., 0, 8, 16, or 24) or value dependent on N_(RE)·Q_(m)·R·v that maybe equal to the intermediate number of information bits. Using the rateback-off factor X can prevent the determined TBS from exceeding anominal code rate. In the equation (1), the brackets represent ceilingfunctions and the “8” operator signifies byte-alignment or sizing.

FIG. 7 is a flow chart illustrating an exemplary process 700 fordetermining a TBS in a single pass according to some aspects of thepresent disclosure. The TBS may be used for transmitting a transportblock with data in a UL or DL transport channel. As described below,some or all illustrated features may be omitted in a particularimplementation within the scope of the present disclosure, and someillustrated features may not be required for implementation of allembodiments. In some examples, the process 700 may be carried out by thescheduling entity 500 illustrated in FIG. 5 or the scheduled entity 600(e.g., UE) illustrated in FIG. 6. In some examples, the process 700 maybe carried out by any suitable apparatus or means for carrying out thefunctions or algorithm described below.

At block 702, a scheduled entity 600 (e.g., UE) can utilize TBSdetermination circuit 644 to determine the value of a maximum code blocksize (K_(cb)). First, the scheduled entity may determine an intermediatevalue T₀=N_(RE)·Q_(m)·R·v−X. Here, N_(RE)·Q_(m)·R·v may represent anintermediate number of information bits. The rate back-off factor X maybe any value (e.g., 0, 8, 16, or 24) that prevents the determined TBSfrom exceeding a nominal code rate. As illustrated in FIG. 8, atdecision block 802, if the condition (R≤1/4) or (R≤0.67 and T₀≤3824) or(T₀≤288) is true, at block 804, the TBS determination circuit 644selects a first base graph (e.g., BG2) and sets K_(cb) to a first value(e.g., 3840); otherwise, at block 806, the TBS determination circuit 644selects a second base graph (e.g., BG1) and sets K_(cb) to a secondvalue (e.g., 8448) that is greater than the first value. In one example,the scheduled entity 600 may receive information (e.g., MCS, code rate,MIMO configuration, etc.) from a scheduling entity 500, to determine theN_(RE), Q_(m), R, and v.

At block 704, the scheduled entity 600 may utilize the TBS determinationcircuit 644 to determine a TB-level CRC size (L_(TB,CRC)) As illustratedin FIG. 9, at decision block 902, if the condition T₀≤3824 is true, atblock 904, the TBS determination circuit 644 may set L_(TB,CRC) to afirst value (e.g., 16); otherwise, at block 906, the TBS determinationcircuit 644 may set L_(TB,CRC) to a second value (e.g., 24) that isgreater than the first value.

At block 706, the scheduled entity 600 may utilize the TBS determinationcircuit 644 to determine a CB CRC size (L_(CB,CRC)) As illustrated inFIG. 10, at decision block 1002, if the condition T₀+L_(TB,CRC)<K_(cb)is true then, at block 1004, the TBS determination circuit 644 setsL_(CB,cRC) to a first value (e.g., 0); otherwise, at block 1006, the TBSdetermination circuit 644 sets L_(CB,CRC) to a second value (e.g., 24)that is greater than the first value.

At block 708, the scheduled entity 600 may utilize the TBS determinationcircuit 644 to determine the number of code blocks (C) or informationblock length based on T₀, K_(cb), L_(TB,CRC), and L_(CB,CRC), forexample, using equation (2) set forth below.

$\begin{matrix}{C = \left\lceil \frac{T_{0} + L_{{TB},{CRC}}}{K_{cb} - L_{{CB},{CRC}}} \right\rceil} & (2)\end{matrix}$

At block 710, the scheduled entity 600 may utilize the TB Sdetermination circuit 644 to determine the code block size (K), forexample, using equation (3) set forth below. Using such code block size,the code blocks can be byte or 8-bit aligned.

$\begin{matrix}{K = {\left\lceil {\frac{1}{8}\frac{T_{0} + L_{{TB},{CRC}}}{C}} \right\rceil 8}} & (3)\end{matrix}$

At block 712, the scheduled entity 600 may utilize the TB Sdetermination circuit 644 to determine the TBS using equation (4) setforth below.TBS=K·C L _(TB,CRC)  (4)

Equation (4) when expanded becomes the single TBS equation (1) as setforth above. At block 714, the scheduled entity 600 may utilize thecommunication circuit 642 and transceiver 610 to transmit a transportblock (TB) with the data based on the determined TBS. Therefore, usingthe process 700, the scheduled entity 600 can use equation (1) orportions thereof in a single pass or a non-recursive manner to determinea TBS that provides byte-aligned code block lengths and requires nopadding. Single-pass means that the process as described above candetermine the TBS without dealing with the cyclic dependencies betweenthe TBS, base graph (e.g., BG1 or BG2), and code block size. That is,the values of the different parameters of equation (1) are determinedonce, and the TBS can be calculated using equation (1) without changingthe parameters based on the determined value of the TBS.

In this example, the term

$\frac{1}{K_{cb} - L_{{CB},{CRC}}}$can take one of four values because the parameters K_(cb) and L_(CB,CRC)each have two predetermined values as described above. For example,K_(cb) may be 3840 or 8448, and L_(CB,CRC) may be 16 or 24. In someaspects of the disclosure, the four values can be stored in a look-uptable to avoid numerical issues or calculations.

Similarly, the term

$\frac{1}{C} = \frac{1}{\left\lceil \frac{L_{{TB},{CRC}} + {N_{RE} \cdot Q_{m} \cdot R \cdot v} - X}{K_{cb} - L_{{CB},{CRC}}} \right\rceil}$can take one of a limited set of values (i.e., the number of code blocksis limited to integers with a maximum value<=200). In some aspects ofthe disclosure, these values can be stored in a look-up table to avoidnumerical issues or calculations. In one aspect of the disclosure, theTBS and intermediate values can be stored in lookup tables, where thelook-up is based on which range N_(RE)·Q_(m)·R·v falls in, as well asthe selected base graph.

In one configuration, the apparatus (e.g., scheduled entity 600) forwireless communication includes means for determining a maximum codeblock size (K_(cb)) of a transport block (TB); means for determining atransport block level cyclic redundancy check size (L_(TB,CRC)); meansfor determining a code block level cyclic redundancy check size(L_(CB,CRC)); means for determining a number of code blocks associatedwith the TB based on the K_(cb), L_(TB,CRC), and L_(CB,CRC); means fordetermining a code block size based on the number of code blocks; andmeans for determining a transport block size (TB S) of the TB in asingle pass as a function of the determined K_(cb), L_(TB,CRC),L_(CB,CRC), number of code blocks, and code block size; and means fortransmitting the TB with data based on the determined TBS. In someaspects of the disclosure, the various means above may be implementedusing the TBS determination circuit 644, the TBS determinationinstructions 656, the transceiver 610, the computer readable medium 606,and other elements described herein to implement the processesillustrated in FIGS. 7-10.

In one aspect, the aforementioned means may be the processor 604 shownin FIG. 6 configured to perform the functions recited by theaforementioned means. In another aspect, the aforementioned means may bea circuit or any apparatus configured to perform the functions recitedby the aforementioned means.

Of course, in the above examples, the circuitry included in theprocessor 604 is merely provided as an example, and other means forcarrying out the described functions may be included within variousaspects of the present disclosure, including but not limited to theinstructions stored in the computer-readable storage medium 606, or anyother suitable apparatus or means described in any one of the FIGS. 1,2,and/or 3, and utilizing, for example, the processes and/or algorithmsdescribed herein in relation to FIGS. 7-10.

Several aspects of a wireless communication network have been presentedwith reference to an exemplary implementation. As those skilled in theart will readily appreciate, various aspects described throughout thisdisclosure may be extended to other telecommunication systems, networkarchitectures and communication standards.

By way of example, various aspects may be implemented within othersystems defined by 3GPP, such as Long-Term Evolution (LTE), the EvolvedPacket System (EPS), the Universal Mobile Telecommunication System(UMTS), and/or the Global System for Mobile (GSM). Various aspects mayalso be extended to systems defined by the 3rd Generation PartnershipProject 2 (3GPP2), such as CDMA2000 and/or Evolution-Data Optimized(EV-DO). Other examples may be implemented within systems employing IEEE802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Ultra-Wideband (UWB),Bluetooth, and/or other suitable systems. The actual telecommunicationstandard, network architecture, and/or communication standard employedwill depend on the specific application and the overall designconstraints imposed on the system.

Within the present disclosure, the word “exemplary” is used to mean“serving as an example, instance, or illustration.” Any implementationor aspect described herein as “exemplary” is not necessarily to beconstrued as preferred or advantageous over other aspects of thedisclosure. Likewise, the term “aspects” does not require that allaspects of the disclosure include the discussed feature, advantage ormode of operation. The term “coupled” is used herein to refer to thedirect or indirect coupling between two objects. For example, if objectA physically touches object B, and object B touches object C, thenobjects A and C may still be considered coupled to one another—even ifthey do not directly physically touch each other. For instance, a firstobject may be coupled to a second object even though the first object isnever directly physically in contact with the second object. The terms“circuit” and “circuitry” are used broadly, and intended to include bothhardware implementations of electrical devices and conductors that, whenconnected and configured, enable the performance of the functionsdescribed in the present disclosure, without limitation as to the typeof electronic circuits, as well as software implementations ofinformation and instructions that, when executed by a processor, enablethe performance of the functions described in the present disclosure.

One or more of the components, steps, features and/or functionsillustrated in FIGS. 1-10 may be rearranged and/or combined into asingle component, step, feature or function or embodied in severalcomponents, steps, or functions. Additional elements, components, steps,and/or functions may also be added without departing from novel featuresdisclosed herein. The apparatus, devices, and/or components illustratedin FIGS. 1-10 may be configured to perform one or more of the methods,features, or steps described herein. The novel algorithms describedherein may also be efficiently implemented in software and/or embeddedin hardware.

It is to be understood that the specific order or hierarchy of steps inthe methods disclosed is an illustration of exemplary processes. Basedupon design preferences, it is understood that the specific order orhierarchy of steps in the methods may be rearranged. The accompanyingmethod claims present elements of the various steps in a sample order,and are not meant to be limited to the specific order or hierarchypresented unless specifically recited therein.

The previous description is provided to enable any person skilled in theart to practice the various aspects described herein. Variousmodifications to these aspects will be readily apparent to those skilledin the art, and the generic principles defined herein may be applied toother aspects. Thus, the claims are not intended to be limited to theaspects shown herein, but are to be accorded the full scope consistentwith the language of the claims, wherein reference to an element in thesingular is not intended to mean “one and only one” unless specificallyso stated, but rather “one or more.” Unless specifically statedotherwise, the term “some” refers to one or more. A phrase referring to“at least one of” a list of items refers to any combination of thoseitems, including single members. As an example, “at least one of: a, b,or c” is intended to cover: a; b; c; a and b; a and c; b and c; and a, band c. All structural and functional equivalents to the elements of thevarious aspects described throughout this disclosure that are known orlater come to be known to those of ordinary skill in the art areexpressly incorporated herein by reference and are intended to beencompassed by the claims. Moreover, nothing disclosed herein isintended to be dedicated to the public regardless of whether suchdisclosure is explicitly recited in the claims. No claim element is tobe construed under the provisions of 35 U.S.C. § 112(f) unless theelement is expressly recited using the phrase “means for” or, in thecase of a method claim, the element is recited using the phrase “stepfor.”

What is claimed is:
 1. A method of transmitting data in a transportblock (TB) in wireless communication, comprising: determining anintermediate value based on a number of resource elements, a modulationorder, a code rate, and a number of MIMO layers for transmitting the TB;selecting a maximum code block size from a plurality of maximum codeblock sizes; determining a number of code blocks associated with the TBbased on the intermediate value and the selected maximum code blocksize; determining a code block size based on the number of code blocks;determining a transport block size (TBS) for the TB as a function of thecode block size, the number of code blocks, and a rate back-off factor;and transmitting the TB using the determined TBS, wherein the rateback-off factor has a value dependent at least on Qm, R, and v, where Qmis a modulation order, R is a code rate, and v is a number ofmultiple-input multiple-output MIMO layers.
 2. The method of claim 1,wherein the determining the code block size comprises determining a codeblock (CB) level cyclic redundancy check (CRC) size by selecting the CBlevel CRC size from a plurality of predetermined CRC sizes based on theintermediate value.
 3. The method of claim 2, wherein the determiningthe code block size further comprises determining a byte-aligned codeblock size.
 4. The method of claim 1, wherein the determining the TBSfurther comprises determining a TB level cyclic redundancy check (CRC)size by selecting the TB level CRC size from a plurality ofpredetermined CRC sizes based on the intermediate value.
 5. The methodof claim 1, wherein the determining the TBS further comprisesdetermining the TBS without cyclic dependencies between the TBS, aselected base graph, and the code block size.
 6. The method of claim 5,further comprising: selecting the base graph based on at least one ofthe code rate or the intermediate value; and determining the maximumcode block size based on the selected base graph.
 7. The method of claim1, wherein the transmitting the TB comprises transmitting the TB with nopadding bits.
 8. The method of claim 1, wherein the determining the TBScomprises: determining the TBS using a non-recursive function of thecode block size and the number of code blocks.
 9. An apparatus ofwireless communication, comprising: a communication interface configuredto transmit data in a transport block (TB); a memory; and a processorcoupled with the communication interface and the memory, wherein theprocessor and the memory are configured to: determine an intermediatevalue based on a number of resource elements, a modulation order, a coderate, and a number of MIMO layers for transmitting the TB; select amaximum code block size from a plurality of maximum code block sizes;determine a number of code blocks associated with the TB based on theintermediate value; determine a code block size based on the number ofcode blocks; determine a transport block size (TBS) for the TB as afunction of the code block size, the number of code blocks, and a rateback-off factor; and transmit the TB using the determined TBS, whereinthe rate back-off factor has a value dependent at least on Qm, R, and v,where Qm is a modulation order, R is a code rate, and v is a number ofmultiple-input multiple-output MIMO lavers.
 10. The apparatus of claim9, wherein, to determine the code block size, the processor and thememory are further configured to: determine a code block (CB) levelcyclic redundancy check (CRC) size by selecting the CB level CRC sizefrom a plurality of predetermined CRC sizes based on the intermediatevalue.
 11. The apparatus of claim 10, wherein, to determine the codeblock size, the processor and the memory are further configured to:determine a byte-aligned code block size.
 12. The apparatus of claim 9,wherein, to determine the TBS, the processor and the memory are furtherconfigured to: determine a TB level cyclic redundancy check (CRC) sizeby selecting the TB level CRC size from a plurality of predetermined CRCsizes based on the intermediate value.
 13. The apparatus of claim 9,wherein, to determine the TBS, the processor and the memory are furtherconfigured to: determine the TBS without cyclic dependencies between theTBS, a selected base graph, and the code block size.
 14. The apparatusof claim 13, wherein the processor and the memory are further configuredto: select the base graph based on at least one of the code rate or theintermediate value; and determine the maximum code block size based onthe selected base graph.
 15. The apparatus of claim 9, wherein, totransmit the TB, the processor and the memory are further configured to:transmit the TB with no padding bits.
 16. The apparatus of claim 9,wherein, to determine the TBS, the processor and the memory are furtherconfigured to: determine the TBS as a non-recursive function of the codeblock size and the number of code blocks.
 17. An apparatus of wirelesscommunication, comprising: means for determining an intermediate valuebased on a number of resource elements, a modulation order, a code rate,and a number of MIMO layers for transmitting a transport block (TB);means for selecting a maximum code block size from a plurality ofmaximum code block sizes; means for determining a number of code blocksassociated with the TB based on the intermediate value and the selectedmaximum code block size; means for determining a code block size basedon the number of code blocks; means for determining a transport blocksize (TBS) for the TB as a function of the code block size, the numberof code blocks, and a rate back-off factor; and means for transmittingthe TB using the determined TBS, wherein the rate back-off factor has avalue dependent at least on Qm, R, and v, where Qm is a modulationorder, R is a code rate, and v is a number of multiple-inputmultiple-output MIMO layers.
 18. A non-transitory computer-readablemedium comprising executable code stored thereon which, when executed bya processor, causes an apparatus for wireless communication to:determine an intermediate value based on a number of resource elements,a modulation order, a code rate, and a number of MIMO layers fortransmitting a transport block (TB); selecting a maximum code block sizefrom a plurality of maximum code block sizes; determine a number of codeblocks associated with the TB based on the intermediate value and theselected maximum code block size; determine a code block size based onthe number of code blocks; determine a transport block size (TBS) forthe TB as a function of the code block size, the number of code blocks,and a rate back-off factor; and transmit the TB using the determinedTBS, wherein the rate back-off factor has a value dependent at least onQm, R, and v, where Qm is a modulation order, R is a code rate, and v isa number of multiple-input multiple-output MIMO lavers.